A Conservative Front Tracking Method in N -Dimensions
نویسندگان
چکیده
We propose a fully conservative Front Tracking algorithm for systems of nonlinear conservation laws. The algorithm can be applied uniformly in one, two, three and N dimensions. Implementation details for this algorithm and tests of fully conservative simulations are reported.
منابع مشابه
A Second-Order Accurate Conservative Front-Tracking Method in One Dimension
This paper presents a conservative front-tracking method for shocks and contact discontinuities that is second-order accurate. It is based on a volume-of-fluid method that treats the moving front with concepts similar to those of an embedded-boundary method. Special care is taken in the centering of the data to ensure the right order of accuracy at the front, and a redistribution step guarantee...
متن کاملConservative Front Tracking in Higher Space Dimensions
We propose a fully conservative Front Tracking algorithm in two space dimension. The algorithm rst uses the point shifted algorithm 12] on two adjacent time levels and then constructs space time hexahedra as computational units. We develope and prove a successful geometric construction under certain interface requirement. This algorithm has a rst order local truncation error for cells near the ...
متن کاملSpace-time discontinuous Galerkin finite element method for two-fluid flows
A novel numerical method for two-fluid flow computations is presented, which combines the space-time discontinuous Galerkin finite element discretization with the level set method and cut-cell based interface tracking. The space-time discontinuous Galerkin (STDG) finite element method offers high accuracy, an inherent ability to handle discontinuities and a very local stencil, making it relativ...
متن کاملConservative Front Tracking with Improved Accuracy
We propose a fully conservative front tracking algorithm for systems of nonlinear conservation laws. The algorithm improves by one order in its convergence rate over most finite difference schemes. Near tracked discontinuities in the solution, the proposed algorithm has O(∆x) errors, improving over O(1) errors commonly found near a discontinuity. Numerical experiments which confirm these assert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Sci. Comput.
دوره 31 شماره
صفحات -
تاریخ انتشار 2007